Matching by Linear Programming and Successive Convexification
نویسندگان
چکیده
منابع مشابه
Successive Convexification for Consistent Labeling
In this thesis, a novel successive convexification scheme is proposed for solving consistent labeling problems with convex regularization terms. Many computer vision problems can be modeled as such consistent labeling problems. The main optimization term, the labeling cost, however, is typically non-convex, which makes the problem difficult. As well, the large search space, i.e., formally the l...
متن کاملMultiple Instance Classification via Successive Linear Programming
The multiple instance classification problem [6,2,12] is formulated using a linear or nonlinear kernel as the minimization of a linear function in a finite dimensional (noninteger) real space subject to linear and bilinear constraints. A linearization algorithm is proposed that solves a succession of fast linear programs that converges in a few iterations to a local solution. Computational resu...
متن کاملSparse and Robust Reject Option Classifier using Successive Linear Programming
In this paper, we propose a new sparse and robust reject option classifier based onminimization of l1 regularized risk under double ramp loss Ldr,ρ. We use DC programming to find the risk minimizer. The algorithm solves a sequence of linear programs to learn the reject option classifier. Moreover, we show that the risk under Ldr,ρ is minimized by generalized Bayes classifier in the reject optio...
متن کاملOn the Convergence of Successive Linear-Quadratic Programming Algorithms
The global convergence properties of a class of penalty methods for nonlinear programming are analyzed. These methods include successive linear programming approaches, and more specifically, the successive linear-quadratic programming approach presented by Byrd, Gould, Nocedal and Waltz (Math. Programming 100(1):27–48, 2004). Every iteration requires the solution of two trust-region subproblems...
متن کاملOn the Convergence of Successive Linear Programming Algorithms
We analyze the global convergence properties of a class of penalty methods for nonlinear programming. These methods include successive linear programming approaches, and more specifically the SLP-EQP approach presented in [1]. Every iteration requires the solution of two trust region subproblems involving linear and quadratic models, respectively. The interaction between the trust regions of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2007
ISSN: 0162-8828,2160-9292
DOI: 10.1109/tpami.2007.1048